Maintaining Consistency without Stagnation during Exploratory Search
نویسنده
چکیده
Many real life search tasks are complex, multi-stepped processes. As people explore a search space, they want to find the most relevant information available to them while remaining oriented in the space they have already explored. This paper argues that during exploration it is important for search engines to present relevant information to their users in a way that maintains the users’ existing contexts. This means that the most relevant results should not necessarily be ranked first, but rather ranked where users expect them to occur. The paper presents a model of what people remember about search results, and shows that it is possible to invisibly merge new information into previously viewed search result lists where information has been forgotten.
منابع مشابه
Heuristic Optimization Techniques for the Design of Digital FIR High Pass Filter: A Comparison
This paper consists of design of digital FIR high pass filter using predator prey optimization and hybrid predator prey optimization (HPPO) technique. HPPO is a combination of predator prey optimization (PPO) and exploratory search where Predator prey optimization is a global search method and exploratory move is a local search method. Local stagnation is possible in PSO but there is no local s...
متن کاملProbabilistic Consistency Boosts MAC and SAC
Constraint Satisfaction Problems (CSPs) are ubiquitous in Artificial Intelligence. The backtrack algorithms that maintain some local consistency during search have become the de facto standard to solve CSPs. Maintaining higher levels of consistency, generally, reduces the search effort. However, due to ineffective constraint propagation, it often penalises the search algorithm in terms of time....
متن کاملA Property of Path Inverse Consistency Leading to an Optimal PIC Algorithm
In constraint networks, the efficiency of a search algorithm is strongly related to the local consistency maintained during search. For a long time, it has been considered that forward checking was the best compromise between the pruning effect and the amount of overhead involved. But recent works, comparing the search algorithms on a large range of networks, show that maintaining arc consisten...
متن کاملMaintaining Soft Arc Consistencies in BnB-ADOPT+ During Search
Distributed Constraint Optimization Problems (DCOPs) have been applied in modeling and solving many multiagent coordination problems, such as meeting scheduling, sensor networks and traffic control. Several distributed algorithms for optimal DCOP solving have been proposed: ADOPT [Modi et al., 2005], DPOP [Petcu and Faltings, 2005], BnB-ADOPT [Yeoh et al., 2010]. BnB-ADOPT-AC and BnB-ADOPTFDAC ...
متن کاملConsistency Maintenance for ABT
One of the most powerful techniques for solving centralized constraint satisfaction problems (CSPs) consists of maintaining local consistency during backtrack search (e.g. [11]). Yet, no work has been reported on such a combination in asynchronous settings. The difficulty in this case is that, in the usual algorithms, the instantiation and consistency enforcement steps must alternate sequential...
متن کامل